منابع مشابه
The Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory terms by introducing a complete digraph G = (V, A) whose vertices v ∈ V := {1, · · · , n} correspond to the n items to be sorted. Depending on the cost function to be be used, different optimization problems can be defi...
متن کاملThe Linear Separation Problem Revisited with ACCPM
We investigate the use of accpm analytic center cutting plane method for solving the linear separation problem which is an important instance of the general data mining concept Given two disjoint subsets of points the problem is to nd a hyperplane which separates these two subsets as well as possible Our method consists of minimizing the total sum of misclassi cation gaps For a large amount of ...
متن کاملOn the relaxation polytope of the linear ordering problem
In the paper we investigate the linear ordering polytope P n. We consider the 3-dicycle relaxation polytope B n and give an example of a fractional vertex of B n such that all non-integral values of the vertex are not equal to 1=2. In this paper also we present a constructive operation (5-Extension) for generating new facets of the linear ordering polytope P n. By connecting MM obius ladders wi...
متن کاملMetaheuristics for large-scale instances of the linear ordering problem
This paper presents iterated local search and great deluge trajectory metaheuristics for the linear ordering problem (LOP). Both metaheuristics are based on the TREE local search method introduced in Sakuraba and Yagiura, 2010 (Efficient local search algorithms for the linear ordering problem, International Transactions in Operational Research 17, pp. 711–737) that is the only method ever appli...
متن کاملSolution of the Linear Ordering Problem (NP=P)
j=1 cijxij s. t. 0 6 xij 6 1, xij + xji = 1, 0 6 xij + xjk − xik 6 1, i 6= j, i 6= k, j 6= k, i, j, k = 1, ..., n. We denote the corresponding polytope by Bn. The polytope Bn has integer vertices corresponding to feasible solutions of the linear ordering problem as well as non-integer vertices. We denote the polytope of integer vertices as Pn. Let us give an example of non-integer vertex in Bn ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2015
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.09.041